Demand-Driven Dataflow for Concurrent Committed-Choice Code
نویسندگان
چکیده
Concurrent logic languages have been traditionally executed in a \greedy" fashion, such that computations are goal-driven. In contrast, non-strict functional programs have been traditionally executed in a \dataaow" fashion, such that computations are demand-driven. The latter method can be superior when allocation of resources such as memory is critical, which is usually the case for large, complex, and/or reactive programs. Speciically, demand-driven execution results in more eecient scheduling and improved termination properties. This paper describes a novel technique for demand-driven execution of concurrent logic language programs.
منابع مشابه
Gannet: a Scheme for Task-level Reconfiguration of Service-based Systems-on-Chip
There is a growing demand for solutions which allow the design of large and complex reconfigurable Systems-on-Chip (SoC) at high abstraction levels. The Gannet project proposes a functional programming approach for high-abstraction design of very large SoCs. Gannet is a distributed service-based SoC architecture, i.e. a network of services offered by hardware or software cores. The Gannet SoC p...
متن کاملModeling Streams-based Variants of Ant Colony Optimisation for Parallel Systems A Dataflow-driven Approach Using S-Net
In this paper we present the implementation of a concurrent ant colony optimisation based solver for the combinatorial Single Machine Total Weighted Tardiness Problem (ACOSMTWTP). We introduce S-Net, a coordination language based on dataflow principles, report on the performance of the implementation and compare it against a sequential and a parallel implementation of the same algorithm in C. A...
متن کاملA Formal Treatment of Non-Deterministic Dataflow Streams in Intensional Logic Programming∗
Intensional logic programming is an alternative to concurrent logic programming languages which employ infinitary data structures such as streams to specify non-terminating computations. Wadge has proposed a logical extension to intensional logic programming, i.e., choice predicates, though which dataflow-style computations can be naturally expressed. This paper discusses the model-theoretical ...
متن کاملCompiling Concurrent Languages for Sequential Processors
Embedded systems often include a traditional processor capable of executing sequential code, but both control and data-dominated tasks are often more naturally expressed using one of the many domain-specific concurrent specification languages. This paper surveys a variety of techniques for translating these concurrent specifications into sequential code. The techniques address compiling a wide ...
متن کاملAn architecture for doing concurrent systems research
An architecture for experimenting with different algorithms in numeric/symbolic computing, concurrent programming paradigms, and interconnection networks is proposed. The architecture comprises a large collection of processors organized in groups called levels. Each level has interconnection networks to communicate with memory units in the level and also a global memory called system memory. Ea...
متن کامل